Incidence and combinatorial properties of lin- ear complexes

نویسندگان

  • Hans Havlicek
  • Corrado Zanella
چکیده

In this paper a generalisation of the notion of polarity is exhibited which allows to completely describe, in an incidence-geometric way, the linear complexes of h-subspaces. A generalised polarity is defined to be a partial map which maps (h−1)-subspaces to hyperplanes, satisfying suitable linearity and reciprocity properties. Generalised polarities with the null property give rise to linear complexes and vice versa. Given that there exists for h > 1 a linear complex of h-subspaces which contains no star—this seems to be an open problem over an arbitrary ground field—the combinatorial structure of a partition of the line set of the projective space into non-geometric spreads of its hyperplanes can be obtained. This line partition has an additional linearity property which turns out to be characteristic. Mathematics Subject Classification (2000). 51A45, 51E20, 51E23, 05B25, 05B40.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vertex Decomposable Simplicial Complexes Associated to Path Graphs

Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...

متن کامل

Stock price analysis using machine learning method(Non-sensory-parametric backup regression algorithm in lin-ear and nonlinear mode)

The most common starting point for investors when buying a stock is to look at the trend of price changes. In recent years, different models have been used to predict stock prices by researchers, and since artificial intelligence techniques, including neural networks, genetic algorithms and fuzzy logic, have achieved successful re-sults in solving complex problems; in this regard, more exploita...

متن کامل

Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes

This paper introduces two new decomposition techniques which are related to the classical notion of shellability of simplicial complexes, and uses the existence of these decompositions to deduce certain numerical properties for an associated enumerative invariant. First, we introduce the notion of M-shellability, which is a generalization to pure posets of the property of shellability of simpli...

متن کامل

Some Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs

In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.

متن کامل

Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm

The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007